Counting components of an integral lamination

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Instances of Software Components

Component software is software that has been assembled from variouspieces of standardized, reusable computer programs, so-called components.Executing component software creates instances of these components. Forseveral reasons, for example, limited resources and/or application require-ments, it can be important to have control over the number of such instances.Clearly, desig...

متن کامل

Counting Generators of Normal Integral Bases

We present a very accurate formula counting norms of normal integral bases in tame abelian extensions of the rational eld. The methods used include applications of Schmidt's Subspace Theorem, Baker's Theorem and the Hardy-Littlewood Method, all from diophantine approximation.

متن کامل

Counting Models Using Connected Components

Recent work by Birnbaum & Lozinskii [1999] demonstrated that a clever yet simple extension of the well-known DavisPutnam procedure for solving instances of propositional satisfiability yields an efficient scheme for counting the number of satisfying assignments (models). We present a new extension, based on recursively identifying connected constraint-graph components, that substantially improv...

متن کامل

Contour Integral Analysis of Planar Components

In the present paper electrodynamics analysis of planar passive components has been carried out using an efficient contour integral approach in conjunction with segmentation technique. Analysis of various tapers viz; linear, exponential, triangular and Klopfenstein has been carried out for validation of the theory developed.

متن کامل

Counting Integral Lamé Equations by Means of Dessins D’enfants

We obtain an explicit formula for the number of Lamé equations (modulo linear changes of variable) with index n and projective monodromy group of order 2N , for given n ∈ Z and N ∈ N. This is done by performing the combinatorics of the ‘dessins d’enfants’ associated to the Belyi covers which transform hypergeometric equations into Lamé equations by pull-back.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: manuscripta mathematica

سال: 2016

ISSN: 0025-2611,1432-1785

DOI: 10.1007/s00229-016-0885-4